The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0), y, y)
cond2(false, x, y) → cond1(neq(x, 0), p(x), y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
neq(0, 0) → false
neq(0, s(x)) → true
neq(s(x), 0) → true
neq(s(x), s(y)) → neq(x, y)
p(0) → 0
p(s(x)) → x

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
gr(s(x), s(y)) →⁺ gr(x, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x), y / s(y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
cond1, cond2, gr, neq

They will be analysed ascendingly in the following order:
cond1 = cond2
gr < cond1
neq < cond2

(8) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
gr, cond1, cond2, neq

They will be analysed ascendingly in the following order:
cond1 = cond2
gr < cond1
neq < cond2

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Induction Base:
gr(gen_0':s4_0(0), gen_0':s4_0(0)) →_R^Ω(1)
false

Induction Step:
gr(gen_0':s4_0(+(n6_0, 1)), gen_0':s4_0(+(n6_0, 1))) →_R^Ω(1)
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) →_IH
false

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
neq, cond1, cond2

They will be analysed ascendingly in the following order:
cond1 = cond2
neq < cond2

(12) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
neq(gen_0':s4_0(n289_0), gen_0':s4_0(n289_0)) → false, rt ∈ Ω(1 + n289₀)

Induction Base:
neq(gen_0':s4_0(0), gen_0':s4_0(0)) →_R^Ω(1)
false

Induction Step:
neq(gen_0':s4_0(+(n289_0, 1)), gen_0':s4_0(+(n289_0, 1))) →_R^Ω(1)
neq(gen_0':s4_0(n289_0), gen_0':s4_0(n289_0)) →_IH
false

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(13) Complex Obligation (BEST)

(14) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)
neq(gen_0':s4_0(n289_0), gen_0':s4_0(n289_0)) → false, rt ∈ Ω(1 + n289₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
cond2, cond1

They will be analysed ascendingly in the following order:
cond1 = cond2

(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol cond2.

(16) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)
neq(gen_0':s4_0(n289_0), gen_0':s4_0(n289_0)) → false, rt ∈ Ω(1 + n289₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
cond1

They will be analysed ascendingly in the following order:
cond1 = cond2

(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol cond1.

(18) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)
neq(gen_0':s4_0(n289_0), gen_0':s4_0(n289_0)) → false, rt ∈ Ω(1 + n289₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

No more defined symbols left to analyse.

(19) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(20) BOUNDS(n^1, INF)

(21) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)
neq(gen_0':s4_0(n289_0), gen_0':s4_0(n289_0)) → false, rt ∈ Ω(1 + n289₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

No more defined symbols left to analyse.

(22) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(23) BOUNDS(n^1, INF)

(24) Obligation:

TRS:
Rules:
cond1(true, x, y) → cond2(gr(x, y), x, y)
cond2(true, x, y) → cond1(neq(x, 0'), y, y)
cond2(false, x, y) → cond1(neq(x, 0'), p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: true:false → 0':s → 0':s → cond1:cond2
true :: true:false
cond2 :: true:false → 0':s → 0':s → cond1:cond2
gr :: 0':s → 0':s → true:false
neq :: 0':s → 0':s → true:false
0' :: 0':s
false :: true:false
p :: 0':s → 0':s
s :: 0':s → 0':s
hole_cond1:cond21_0 :: cond1:cond2
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

No more defined symbols left to analyse.

(25) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(26) BOUNDS(n^1, INF)